Combinatorial and algorithmic aspects of networking (Third workshop, CAAN 2006, Chester, UK, July 2, 2006)Erlebach, Thomas.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-48822-7, 1 vol.(VIII-134 p.), isbn 3-540-48822-7Conference Proceedings

Approximation and online algorithms (Third international workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005)Erlebach, Thomas; Persinao, Giuseppe.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-32207-8, 1Vol, X-347 p, isbn 3-540-32207-8Conference Proceedings

Algorithms (ESA 2006)Azar, Yossi; Erlebach, Thomas.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-38875-3, 1Vol, XVIII-843 p, isbn 3-540-38875-3Conference Proceedings

Recent Advances on Approximation Algorithms for Minimum Energy Range Assignment Problems in Ad-Hoc Wireless NetworksPELEG, David.Lecture notes in computer science. 2006, pp 1-4, issn 0302-9743, isbn 3-540-48822-7, 4 p.Conference Paper

The complexity of path coloring and call schedulingERLEBACH, Thomas; JANSEN, Klaus.Theoretical computer science. 2001, Vol 255, Num 1-2, pp 33-50, issn 0304-3975Article

Conversion of coloring algorithms into maximum weight independent set algorithmsERLEBACH, Thomas; JANSEN, Klaus.Discrete applied mathematics. 2005, Vol 148, Num 1, pp 107-125, issn 0166-218X, 19 p.Article

The maximum edge-disjoint paths problem in bidirected treesERLEBACH, Thomas; JANSEN, Klaus.SIAM journal on discrete mathematics (Print). 2001, Vol 14, Num 3, pp 326-355, issn 0895-4801Article

The European Symposium on Algorithms (ESA 2006)AZAR, Yossi; ERLEBACH, Thomas.Algorithmica. 2009, Vol 53, Num 4, issn 0178-4617, 166 p.Conference Proceedings

Routing to reduce the cost of wavelength conversionERLEBACH, Thomas; STEFANAKOS, Stamatis.Discrete applied mathematics. 2008, Vol 156, Num 15, pp 2911-2923, issn 0166-218X, 13 p.Article

Deciding relaxed two-colorability : A hardness jumpBERKE, Robert; SZABO, Tibor.Lecture notes in computer science. 2006, pp 124-135, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

Finding total unimodularity in optimization problems solved by linear programsDÜRR, Christoph; HURAND, Mathilde.Lecture notes in computer science. 2006, pp 315-326, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

Single machine precedence constrained scheduling is a vertex cover problemAMBÜHL, Christoph; MASTROLILLI, Monaldo.Lecture notes in computer science. 2006, pp 28-39, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

Tighter approximations for maximum induced matchings in regular graphsGOTTHILF, Zvi; LEWENSTEIN, Moshe.Lecture notes in computer science. 2006, pp 270-281, issn 0302-9743, isbn 3-540-32207-8, 1Vol, 12 p.Conference Paper

Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria ProblemBILO, Davide; GUALA, Luciano; PROIETTI, Guido et al.Lecture notes in computer science. 2006, pp 19-30, issn 0302-9743, isbn 3-540-48822-7, 12 p.Conference Paper

Estimating entropy over data streamsBHUVANAGIRI, Lakshminath; GANGULY, Sumit.Lecture notes in computer science. 2006, pp 148-159, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

Lower and upper bounds on FIFO buffer management in QoS switchesENGLERT, Matthias; WESTERMANN, Matthias.Lecture notes in computer science. 2006, pp 352-363, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

Minimum-Energy Broadcasting in Wireless Networks in the d-Dimensional Euclidean Space (The α < d Case)LINGAS, Andrzej; PERSSON, Mia; WAHLEN, Martin et al.Lecture notes in computer science. 2006, pp 112-124, issn 0302-9743, isbn 3-540-48822-7, 13 p.Conference Paper

A PTAS for the minimum dominating set problem in unit disk graphsNIEBERG, Tim; HURINK, Johann.Lecture notes in computer science. 2006, pp 296-306, issn 0302-9743, isbn 3-540-32207-8, 1Vol, 11 p.Conference Paper

Approximation in preemptive stochastic online schedulingMEGOW, Nicole; VREDEVELD, Tjark.Lecture notes in computer science. 2006, pp 516-527, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

Engineering highway hierarchiesSANDERS, Peter; SCHULTES, Dominik.Lecture notes in computer science. 2006, pp 804-816, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 13 p.Conference Paper

On the complexity of the multiplication method for monotone CNF/DNF dualizationELBASSIONI, Khaled M.Lecture notes in computer science. 2006, pp 340-351, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

Scheduling of a Smart Antenna : Capacitated Coloring of Unit Circular-Arc GraphsEVEN, Guy; SHAHAR, Shimon.Lecture notes in computer science. 2006, pp 58-71, issn 0302-9743, isbn 3-540-48822-7, 14 p.Conference Paper

Scheduling parallel jobs with linear speedupGRIGORIEV, Alexander; UETZ, Marc.Lecture notes in computer science. 2006, pp 203-215, issn 0302-9743, isbn 3-540-32207-8, 1Vol, 13 p.Conference Paper

A better-than-greedy algorithm for k-set multicoverFUJITO, Toshihiro; KURAHASHI, Hidekazu.Lecture notes in computer science. 2006, pp 176-189, issn 0302-9743, isbn 3-540-32207-8, 1Vol, 14 p.Conference Paper

Approximate k-steiner forests via the lagrangian relaxation technique with internal preprocessingSEGEV, Danny; SEGEV, Gil.Lecture notes in computer science. 2006, pp 600-611, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper